Classes of languages proof against regular pumping
نویسندگان
چکیده
منابع مشابه
Classes of Languages Proof Against Regular Pumping
— The main purpose of this note is to collect a number ofscattered properties, examples and unanswered questions concerning classes of languages which are proof against varions farms of pumping of the words in the language. These forms of pumping lead to different infinité hiérarchies. Requiring that it must be possible to select from a prefix the substring to be repeated independently of the s...
متن کاملPolynomial Operators on Classes of Regular Languages
We assign to each positive variety V and a fixed natural number k the class of all (positive) boolean combinations of the restricted polynomials, i.e. the languages of the form L0a1L1a2 . . . a`L`, where ` ≤ k, a1, . . . , a` are letters and L0, . . . , L` are from the variety V. For this polynomial operator we give a certain algebraic counterpart which works with identities satisfied by syntac...
متن کاملOn algebraic and logical specifications of classes of regular languages
The paper studies classes of regular languages based on algebraic constraints imposed on transitions of automata and discusses issues related to speci%cations of these classes from algebraic, computational and logical points of view. c © 2002 Published by Elsevier Science B.V.
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1980
ISSN: 0399-0540
DOI: 10.1051/ita/1980140201691